Algebraic State Machines
نویسندگان
چکیده
We introduce the concept of an algebraic state machine. This is a state transition machine all parts of that are described by algebraic and logical means. This way we base the description of state transition systems exclusively on the concept of algebraic specifications. Also the state of an algebraic state machine is represented by an algebra. In particular, we describe the state spaces of the state machine by algebraic techniques, and the state transitions by special axioms called transition rules. Then we show how known concepts from algebraic specifications can be used to provide a notion of parallel composition with asynchronous interaction for algebraic state machines. As example we introduce a notion of object-oriented component and show how algebraic state machines can formalize such components.
منابع مشابه
Decomposition of verification of machine programs based on control-state Abstract State Machines
We are presenting a method verifying programs based on extended control-state Abstract State Machines (ASM). Programs are special initial states in ASM’s. The aim is to prove that every run holds an algebraic specification of functions. The proof of different functions could be made by independent steps.
متن کاملOn covering of products of T-generalized state machines
We introduce the concepts of T-generalized state machines and coverings of products of them. Also some of algebraic properties of them are investigated. Finely some products such as direct sum and sum of Tgeneralized state machines are introduced. An interesting distributive property of cascade product over the sum of Tgeneralized state machines concern to covering of T-generalized state machin...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملCompiling Abstract State Machines
Abstract State Machines (ASMs) have been widely used to specify software and hardware systems. Only a few of these specifications are executable, although there are several interpreters and some compilers. This paper introduces a compilation scheme to transform an ASM specification in the syntax of the ASM-Workbench into C++. In particular, we transform algebraic types, pattern matching, functi...
متن کاملCompiling Abstract State Machines to C++
Abstract State Machines (ASMs) have been widely used to specify software and hardware systems. Only a few of these specifications are executable, although there are several interpreters and some compilers. This paper introduces a compilation scheme to transform an ASM specification in the syntax of the ASM-Workbench into C++. In particular, we transform algebraic types, pattern matching, functi...
متن کامل